A Packet Marking Algorithm for Congestion Pricing

نویسندگان

  • Aleksi Penttinen
  • Jorma Virtamo
چکیده

In the resource pricing concept, developed by Kelly et al. [1], the network marks packets with appropriate price signals to direct the users’ actions. The theoretically correct congestion dependent prices, however, are not all known at the time when the marking occurs at a network resource. In this paper, we propose a packet marking algorithm which maximally utilises the information available at the time of marking. The known prices are marked directly on the packets, while the unknown ones are replaced by their expected values. Calculation of the expected values depends on a suitable system model. We derive these prices for a simple M/M/1/K resource model and generalise the result for GI/GI/1/K models using an approximate diffusion approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VRED: An improvement over RED algorithm by using queue length growth velocity

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

متن کامل

VRED: An improvement over RED algorithm by using queue length growth velocity

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

متن کامل

Observations on using marks for pricing in multiclasspacket networks to provide multidimensional

| We investigate through simple simulations some basic issues surrounding the use of marks for pricing in multiclass packet networks with multi-dimensional quality of service(QoS) prooles. We nd that the use of only one class of packets is not suf-cient to provide satisfactory multidimensional QoS performance in some simple situations. We also nd that by using appropriate control mechanisms (e....

متن کامل

Estimation of Congestion Price Using Probabilistic Packet Marking

One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers so that a receiver can estimate the sum of link congestion prices along a path. We consider two such algorithms—a well-known algorithm called Random Exponential Marking (REM) and a novel algorithm called Random Additive Marking (R...

متن کامل

Application of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems

The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002